package leetcode.code1835;

public class Solution {
	public int getXORSum(int[] arr1, int[] arr2) {
		int xor = 0;
		for (int num : arr2) {
			xor ^= num;
		}
		int ans = 0;
		for (int num : arr1) {
			ans ^= (num & xor);
		}
		return ans;
	}
}
